segment tree造句

But the structures can be used as associated structure of segment trees.
The importance of the segment tree is that the segments within each node s canonical subset can be stored in any arbitrary manner.
Such a segment tree uses linear storage, and requires an O ( log " n " ) query time, so it is optimal.
Another advantage of the segment tree is that it can easily be adapted to counting queries; that is, to report the number of segments containing a given point, instead of reporting the segments themselves.
Segment trees support searching for all the intervals that contain a query point in O ( log " n " + " k " ), " k " being the number of retrieved intervals or segments.
It's difficult to find segment tree in a sentence. 用segment tree造句挺难的

A query for a segment tree, receives a point " q x " ( should be one of the leaves of tree ), and retrieves a list of all the segments stored which contain the point " q x ".
The segment tree is less efficient than the interval tree for range queries in one dimension, due to its higher storage requirement : O ( " n " log " n " ) against the O ( " n " ) of the interval tree.